Summing planar diagrams

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Summing planar diagrams

Abstract: We consider the sum of planar diagrams for open strings propagating on N D3-branes and show that it can be recast as the propagation of a closed string with a Hamiltonian H = H0 − gsN P̂ where H0 is the free Hamiltonian and P̂ is the hole or loop insertion operator. We compute explicitly P̂ and study its properties. When the distance y to the D3-branes is much larger than the string leng...

متن کامل

Planar diagrams from optimization

S.K. Nechaev, A.N. Sobolevski, O.V. Valba LPTMS, Université Paris Sud, 91405 Orsay Cedex, France P.N. Lebedev Physical Institute of the Russian Academy of Sciences, 119991, Moscow, Russia Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), 127994 Moscow, Russia National Research University Higher School of Economics, 101000 Moscow, Russia M...

متن کامل

Planar Multiple-Valued Decision Diagrams

In VLSI, crossings occupy space and cause delay. Therefore, there is significant benefit to planar circuits. We propose the use of planar multiple-valued decision diagrams to produce planar multiple-valued circuits. Specifically, we show conditions on 1) threshold functions, 2 symmetric functions, and 3) monodiagrams. Our results apply to binary functions, as well. For example, we show that all...

متن کامل

Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way

We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach allows us to draw, in a crossing-free manner, graphs—such as software interaction diagrams—that would normally have many crossings. The main idea of this approach is quite simple: we allow groups of edges to be merged tog...

متن کامل

Counting non planar diagrams: an exact formula

We present an explicit solution of a simply stated, yet unsolved, combinatorial problem, of interest both in quantum field theory (Feynman diagrams enumeration, beyond the planar approximation) and in statistical mechanics (high temperature loop expansion of some frustrated lattice spin model). PACS: 02.10.Eb, 02.10.Nj, 05.50.+q ∗e-mail: [email protected] The problem of counting the number of r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of High Energy Physics

سال: 2008

ISSN: 1029-8479

DOI: 10.1088/1126-6708/2008/10/075